Finding Hard Instances of Satisfiability in Lukasiewicz Logics

One aspect that has been poorly studied in multiple-valued logics, and in particular in Lukasiewicz logics, is the generation of instances of varying difficulty for evaluating, comparing and improving satisfiability solvers. In this paper we present a new class of clausal forms, called Lukasiewicz (L-)clausal forms, motivate their usefulness, study their complexity, and report on an empirical investigation that shows an easyhard-easy pattern and a phase transition phenomenon when testing the satisfiability of L-clausal forms. Source URL: https://www.iiia.csic.es/en/node/54415 Links [1] https://www.iiia.csic.es/en/bibliography?f[author]=657 [2] https://www.iiia.csic.es/en/staff/felip-many%C3%A0 [3] https://www.iiia.csic.es/en/staff/amanda-vidal [4] https://www.iiia.csic.es/en/staff/mateu-villaret